Negative circuits for flows and submodular flows
نویسندگان
چکیده
منابع مشابه
Algorithms for Submodular Flows ∗
SUMMARY We first describe fundamental results about submodular functions and submodular flows, which lay a basis for devising efficient algorithms for submodular flows. We then give a comprehensive survey on algorithms for submodular flows and show some possible future research directions.
متن کاملDegree constrained submodular flows
We consider the problem of finding a minimum cost 0 − 1 submodular flow with the additional constraint that the sum of the incoming and outgoing flow at each node cannot exceed a given limit. We show that this problem is NP-hard, but it can be approximated in the following sense: we can find a submodular flow of cost not greater than the optimum which violates the additional constraints by at m...
متن کاملLattice Polyhedra and Submodular Flows
Lattice polyhedra, as introduced by Gröflin and Hoffman, form a common framework for various discrete optimization problems. They are specified by a lattice structure on the underlying matrix satisfying certain suband supermodularity constraints. Lattice polyhedra provide one of the most general frameworks of total dual integral systems. So far no combinatorial algorithm has been found for the ...
متن کاملDegree Bounded Matroids and Submodular Flows
We consider two related problems, the Minimum Bounded Degree Matroid Basis problem and the Minimum Bounded Degree Submodular Flow problem. The first problem is a generalization of the Minimum Bounded Degree Spanning Tree problem: we are given a matroid and a hypergraph on its ground set with lower and upper bounds f(e) ≤ g(e) for each hyperedge e. The task is to find a minimum cost basis which ...
متن کاملSimple Push-relabel Algorithms for Matroids and Submodular Flows
We derive simple push-relabel algorithms for the matroid partitioning, matroid membership, and submodular flow feasibility problems. It turns out that, in order to have a strongly polynomial algorithm, the lexicographic rule used in all previous algorithms for the two latter problems can be avoided. Its proper role is that it helps speeding up the algorithm in the last problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1992
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90231-x